On the terminal Steiner tree problem
نویسندگان
چکیده
We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ + 2, where ρ is the best-known approximation ratio for the graph Steiner tree problem. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
On approximation algorithms for the terminal Steiner tree problem
The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial time approximation algorithm for the terminal Steiner tree problem can achieve an approximation ratio less than (1− o(1)) lnn unless NP has slightly superpolynomial time algorithms. Moreover, we present a ...
متن کاملA Note on Online Steiner Tree Problems
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online problem which becomes the well-known online Steiner tree problem if the number of nodes in each burst is exactly one and becomes the classical Steiner tree problem if all the nodes that need to be connected appear in a single burst. In undirect...
متن کاملSolving a tri-objective convergent product network using the Steiner tree
Considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. To form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...
متن کاملTerminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to find a Steiner tree T such that any point in P is a leaf in T and the length of each edge in T is no more than a constant b. The objective of the problem is to minimize the number of Steiner points in T . This problem is mot...
متن کامل1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
The Steiner tree problem requires to nd a shortest tree connecting a given set of terminal points in a metric space. We suggest a better and fast heuristic for the Steiner problem in graphs and in rectilinear plane. This heuristic nds a Steiner tree at most 1.757 and 1.267 times longer than the optimal solution in graphs and rectilinear plane, respectively.
متن کاملImproved Approximation Algorithm for the (1,2)-Partial-Terminal Steiner Tree Problem
Given a complete graph G = (V,E) with a metric cost function c : E → R and two vertex subsets R ⊂ V and R ⊆ R, a partial-terminal Steiner tree is a Steiner tree which contains all the vertices in R such that all the vertices in R are leaves. The partial-terminal Steiner tree problem (PTSTP) is to find a partial-terminal Steiner tree with the minimum cost. The problem has been shown to be NP-har...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 84 شماره
صفحات -
تاریخ انتشار 2002